Phase recovery, MaxCut and complex semidefinite programming
نویسندگان
چکیده
منابع مشابه
Phase recovery, MaxCut and complex semidefinite programming
Phase retrieval seeks to recover a signal x ∈ C from the amplitude |Ax| of linear measurements Ax ∈ C. We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm wh...
متن کاملTitle: a Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem a Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
We investigate solution of the maximum cut problem using a polyhedral cut and price approach. The dual of the well-known SDP relaxation of maxcut is formulated as a semi-infinite linear programming problem, which is solved within an interior point cutting plane algorithm in a dual setting; this constitutes the pricing (column generation) phase of the algorithm. Cutting planes based on the polyh...
متن کاملA Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
We investigate solution of the maximum cut problem using a polyhedral cut and price approach. The dual of the well-known SDP relaxation of maxcut is formulated as a semi-infinite linear programming problem, which is solved within an interior point cutting plane algorithm in a dual setting; this constitutes the pricing (column generation) phase of the algorithm. Cutting planes based on the polyh...
متن کاملOptimum quantum error recovery using semidefinite programming
Andrew S. Fletcher,* Peter W. Shor, and Moe Z. Win Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, Massachusetts 02420 Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Received 7 June 2006; publishe...
متن کاملComplex Quadratic Optimization and Semidefinite Programming
In this paper we study the approximation algorithms for a class of discrete quadratic optimization problems in the Hermitian complex form. A special case of the problem that we study corresponds to the max-3-cut model used in a recent paper of Goemans and Williamson. We first develop a closed-form formula to compute the probability of a complex-valued normally distributed bivariate random vecto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2013
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-013-0738-9